Time-Scale Separation in Networks: State-Dependent Graphs and Consensus Tracking
نویسندگان
چکیده
منابع مشابه
Model reduction of genetic-metabolic networks via time scale separation
Model reduction techniques often prove indispensable in the analysis of physical and biological phenomena. A succesful reduction technique can substantially simplify a model while retaining all of its pertinent features. In metabolic networks, metabolites evolve on much shorter time scales than the catalytic enzymes. In this chapter, we exploit this discrepancy to justify the reduction via time...
متن کاملModularity produces small-world networks with dynamical time- scale separation
The functional consequences of local and global dynamics can be very different in natural systems. Many such systems have a network description that exhibits strong local clustering as well as high communication efficiency, often termed as small-world networks (SWN). We show that modular organization in otherwise random networks generically give rise to SWN, with a characteristic time-scale sep...
متن کاملState Dependent AIMD Algorithms and Consensus Problems
The standard linear AIMD algorithm employed in TCP (transmission control protocol) describes probing strategies that evolve in cycles, each cycle having two phases. The first phase of the cycles is instantaneous. It occurs when capacity is reached, users are notified and each responds by down-scaling its utilization-rate (abruptly) by a multiplicative factor. This phase is called the Multiplica...
متن کاملState Consensus for Discrete-time Multi-agent Systems over Time-varying Graphs
We study the state consensus problem for linear shift-invariant discrete-time homogeneous multi-agent systems (MASs) over time-varying graphs. A novel approach based on the small gain theorem is proposed to design the consensus control protocols for both neutrally stable and neutrally unstable MASs, assuming the uniformly connected graphs. It is shown that the state consensus can be achieved fo...
متن کاملDegree-dependent intervertex separation in complex networks.
We study the mean length (l)(k) of the shortest paths between a vertex of degree k and other vertices in growing networks, where correlations are essential. In a number of deterministic scale-free networks we observe a power-law correction to a logarithmic dependence, (l)(k) = A ln[N/k((gamma-1)/2)]-Ck(gamma-1)/N+ in a wide range of network sizes. Here N is the number of vertices in the network...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2019
ISSN: 2325-5870,2372-2533
DOI: 10.1109/tcns.2018.2800401